package com.zh.note.leetcode.dp;

/**
 * 62. 不同路径
 * <p>
 * dp[i][j] =  dp[i - 1][j] + dp[i][j - 1]
 */
public class LC_62_uniquePaths {


    public static int uniquePaths(int m, int n) {

        int[][] dp = new int[m][n];

        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }
        for (int j = 0; j < n; j++) {
            dp[0][j] = 1;
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
        return dp[m - 1][n - 1];
    }

    public static void printArray(int[][] dp) {
        for (int i = 0; i < dp.length; i++) {
            for (int j = 0; j < dp[0].length; j++) {
                System.out.println(dp[i][j]);
            }
        }
    }

    public static void main(String[] args) {
        uniquePaths(3, 7);
    }
}
